Constraint Satisfaction with Delayed Evaluation

STCSP: A Representation Model for Sequential Patterns

Temporal constraint satisfaction problem is a useful formalism for representing and reasoning about temporal occurrences and their temporal relationships. In this paper, we present a new temporal constraint satisfaction problem to deal with sequential patterns (STCSP). The problem is represented as a constraint satisfaction problem with sequential valuated variables, where multiple sequential v...

An Extensive Evaluation of Portfolio Approaches for Constraint Satisfaction Problems

Agent Based Processing of Global Evaluation Function

Load balancing across a networked environment is a monotonous job. Moreover, if the job to be distributed is a constraint satisfying one, the distribution of load demands core intelligence. This paper proposes parallel processing through Global Evaluation Function by means of randomly initialized agents for solving Constraint Satisfaction Problems. A potential issue about the number of agents i...

Concurrent search for distributed CSPs

A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search processes (SPs) that operate concurrently and scan non-intersecting parts of the global search space. Each SP is represented by a unique data structure, containing a current partial assignment (CPA), that is circulated am...

Visual Analogy: Viewing Retrieval and Mapping as Constraint Satisfaction Problems

We examine the retrieval and mapping tasks of visual analogy as constraint satisfaction problems. We describe a constraint satisfaction method for the two tasks; the method organizes the source cases in a discrimination tree; uses heuristics to guide the search; performs backtracking, and searches all the source cases at once. We present an evaluation of this method for retrieval and mapping of...